package cn.hesion.leetcode;
/**
 * ClassName: MaxSatisfied <br/>
 * Description: <br/>
 * date: 2022/5/20 5:37<br/>
 *
 * @author Hesion<br />
 * @version
 * @since JDK 1.8
 */

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * 1052. 爱生气的书店老板
 *
 * @author: hesion
 * @create: 2022-05-20 05:37
 **/
public class MaxSatisfied {
    public int maxSatisfied(int[] customers, int[] grumpy, int minutes) {
        int n = customers.length;
        int res = 0;
        int finalMax = 0;
        for (int i = 0;i<i+minutes-1&& i < n; i++) {
            int tmpMax=0;
            if(grumpy[i]==1){
                res+=customers[i];
            }else {
            }
        }
        res+=finalMax;
        return res;
    }

    public static void main(String[] args) {
        System.out.println(new MaxSatisfied().maxSatisfied(new int[]{1, 0, 1, 2, 1, 1, 7, 5}, new int[]{0, 1, 0, 1, 0, 1, 0, 1}, 3));
    }
}
